Extremal Uniquely Resolvable Multisets
نویسندگان
چکیده
For positive integers and , consider a multiset of nonempty subsets such that there is unique partition these into partitions . We study the maximum possible size multiset. focus on regime show When for any this lower bound simplifies to we matching upper optimal up factor also compute exactly when
منابع مشابه
Extremal Ideals of the Lattice of Multisets
We present here constructions of ideals A of the poset of n-vectors (x1, ..., xn) with integer entries, ordered coordinatewise, on which the maximal and minimal values of Wφ(A) = ∑ x∈A φ( ∑n i=1 xi) are achieved for a given unimodal function φ. As a consequence we get a new approach to prove the well-known ClementsLindström Theorem [6].
متن کاملNested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL
We present a collection of formalized results about finite nested multisets, developed using the Isabelle/HOL proof assistant. The nested multiset order is a generalization of the multiset order that can be used to prove termination of processes. Hereditary multisets, a variant of nested multisets, offer a convenient representation of ordinals below 0. In Isabelle/HOL, both nested and hereditar...
متن کاملFormalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals
This Isabelle/HOL formalization introduces a nested multiset datatype and de nes Dershowitz and Manna's nested multiset order. The order is proved well founded and linear. By removing one constructor, we transform the nested multisets into hereditary multisets. These are isomorphic to the syntactic ordinals the ordinals can be recursively expressed in Cantor normal form. Addition, subtraction, ...
متن کاملStirling permutations on multisets
A permutation σ of a multiset is called Stirling permutation if σ(s) ≥ σ(i) as soon as σ(i) = σ(j) and i < s < j. In our paper we study Stirling polynomials that arise in the generating function for descent statistics on Stirling permutations of any multiset. We develop generalizations of the classical Stirling numbers and present their combinatorial interpretations. Particularly, we apply the ...
متن کاملParsing Partially Ordered Multisets
A partiallyordered multiset or pomset is a generalizationof a string in which the total order has been relaxed to a partial order. Strings are often used as a model for sequential computation; pomsets are a natural model for parallel and distributed computation. By viewing pomsets as a generalization of strings, the question is raised whether concepts from language theory can be generalized to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2023
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/22m1481129